Global Constraint Catalog, Volume II, Time-Series Constraints
نویسندگان
چکیده
First this report presents a restricted set of finite transducers used to synthesise structural time-series constraints described by means of a multi-layered function composition scheme. Second it provides the corresponding synthesised catalogue of structural time-series constraints where each constraint is explicitly described in terms of automata with accumulators.
منابع مشابه
A Constraint Seeker: Finding and Ranking Global Constraints from Examples
In this paper we describe a Constraint Seeker application which provides a web interface to search for global constraints in the global constraint catalog, given positive and negative ground examples. Based on the given instances the tool returns a ranked list of matching constraints, the rank indicating whether the constraint is likely to be the intended constraint of the user. We give some ex...
متن کاملGraph Properties Based Filtering
This article presents a generic filtering scheme, based on the graph description of global constraints. This description is defined by a network of binary constraints and a list of elementary graph properties: each solution of the global constraint corresponds to a subgraph of the initial network, retaining only the satisfied binary constraints, and which fulfills all the graph properties. The ...
متن کاملHarnessing Tractability in Constraint Satisfaction Problems
The Constraint Satisfaction Problem (CSP) is a fundamental problem in computer science that takes as input a finite set of variables, a finite set of values and a set of constraints, which are arbitrary relations imposed on certain subsets of variables. The goal is to find an assignment of values to variables that satisfies every constraint. The generality of CSP and its connections to logic, u...
متن کاملUsing the Global Constraint Seeker for Learning Structured Constraint Models: A First Attempt
Considering problems that have a strong internal structure, this paper shows how to generate constraint models from a set of positive, flat samples (i.e., solutions) without knowing a priori neither the constraint candidates, nor the way variables are shared within constraints. We describe two key contributions to building such a model generator: (1) First, learning is modeled as a bi-criteria ...
متن کاملVOLUME MINIMIZATION WITH DISPLACEMENT CONSTRAINTS IN TOPOLOGY OPTIMIZATION OF CONTINUUM STRUCTURES
In this paper, a displacement-constrained volume-minimizing topology optimization model is present for two-dimensional continuum problems. The new model is a generalization of the displacement-constrained volume-minimizing model developed by Yi and Sui [1] in which the displacement is constrained in the loading point. In the original model the displacement constraint was formulated as an equali...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1609.08925 شماره
صفحات -
تاریخ انتشار 2016